Verbal Semantics via Petri Nets
نویسندگان
چکیده
This paper introduces Petri Nets (Peterson 1981) into the vexed question of lexical semantic representation. We argue that Petri Nets can offer new insights into the organization of lexical meaning. Petri Nets can furthermore be translated directly into linear logic, thus ensuring compatibility with the glue logic semantic construction already defined within LFG (Dalrymple 1999). The potential usefulness of Petri Nets is demonstrated with respect to light verbs in Urdu.
منابع مشابه
Process versus Unfolding Semantics for Place/Transition Petri Nets
In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical “token game”, one can model the behaviour of Petri nets via nonsequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models ar...
متن کاملOn the Model of Computation of Place/Transition Petri Nets
In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical “token game”, one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models a...
متن کاملLogic Programming Petri Nets
With the purpose of modeling, specifying and reasoning in an integrated fashion with procedural and declarative aspects (both commonly present in cases or scenarios), the paper introduces Logic Programming Petri Nets (LPPN), an extension to the Petri Net notation providing an interface to logic programming constructs. Two semantics are presented. First, a hybrid operational semantics that separ...
متن کاملFunctorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. ...
متن کاملRepresentation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
We give a high-level overview of our recent results which extend and unify the lines of research initiated by Meseguer and Montanari under the motto “Petri nets are monoids”, and by Marti-Oliet, Meseguer and other authors in their linear logic axiomization of Petri nets. In particular, we investigate the use of rewriting logic, which was partially inspired by the two aforementioned approaches, ...
متن کامل